Queueing Models of Shared - Memory

Performance predictions ooer the designer of parallel applications guidelines to make a selection from a range of parallel machines, optimise machine parameters or optimise the parallel compilation process. In this paper , queueing models of parallel applications running on shared-memory machines are studied. An important aspect of performance modelling is the question of eecient analysis. Therefore, special attention is paid to aggregation techniques, reducing subsystem models with a high level of replication to one ow-equivalent queueing centre. In many cases closed-form expressions can be derived for the performance measures of highly symmetric sub-models. The various kinds of interconnection networks applied in shared-memory computers are studied, and analytical performance predictions are compared to simulation results. Both packet-switching and circuit-switching networks are considered.